Randomized Solutions to Convex Programs with Multiple Chance Constraints
نویسندگان
چکیده
منابع مشابه
Uncertain Convex Programs: Randomized Solutions
Many engineering problems can be cast as optimization problems subject to convex constraints that are parameterized by an uncertainty or ‘instance’ parameter. A recently emerged successful paradigm for attacking these problems is robust optimization, where one seeks a solution which simultaneously satisfies all possible constraint instances. In practice, however, the robust approach is effectiv...
متن کاملConvex Approximations of Chance Constrained Programs
We consider a chance constrained problem, where one seeks to minimize a convex objective over solutions satisfying, with a given close to one probability, a system of randomly perturbed convex constraints. Our goal is to build a computationally tractable approximation of this (typically intractable) problem, i.e., an explicitly given deterministic optimization program with the feasible set cont...
متن کاملOptimal Control with Fuzzy Chance Constraints
In this paper, a model of an optimal control problem with chance constraints is introduced. The parametersof the constraints are fuzzy, random or fuzzy random variables. Todefuzzify the constraints, we consider possibility levels. Bychance-constrained programming the chance constraints are converted to crisp constraints which are neither fuzzy nor stochastic and then the resulting classical op...
متن کاملUncertain convex programs: randomized solutions and confidence levels
Many engineering problems can be cast as optimization problems subject to convex constraints that are parameterized by an uncertainty or 'instance' parameter. Two main approaches are generally available to tackle constrained optimization problems in presence of uncertainty: robust optimization and chance-constrained optimization. Robust optimization is a deterministic paradigm where one seeks a...
متن کاملThe Exact Feasibility of Randomized Solutions of Uncertain Convex Programs
Many optimization problems are naturally delivered in an uncertain framework, and one would like to exercise prudence against the uncertainty elements present in the problem. In previous contributions, it has been shown that solutions to uncertain convex programs that bear a high probability to satisfy uncertain constraints can be obtained at low computational cost through constraints randomiza...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Optimization
سال: 2013
ISSN: 1052-6234,1095-7189
DOI: 10.1137/120878719